package com.zlk.algorithm.algorithm.sort.heap;

import java.io.*;

// 最多线段重合问题
// 测试链接 : https://www.nowcoder.com/practice/1ae8d0b6bb4e4bcdbf64ec491f63fc37
// 请同学们务必参考如下代码中关于输入、输出的处理
// 这是输入输出处理效率很高的写法
// 提交以下的code，提交时请把类名改成"Main"，可以直接通过
// 多个闭区间线段，统计最大重合数
public class Code04_MaxCover {


    public static int MAXN = 10001;
    public static int n;
    public static int[][] arr = new int[MAXN][2];

    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        StreamTokenizer in = new StreamTokenizer(bufferedReader);
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        while (in.nextToken()!=-1){
            n = (int)in.nval;
            for (int i = 0; i < n; i++) {
                in.nextToken();
                arr[0][0] = (int)in.nval;
                in.nextToken();
                arr[0][1] = (int)in.nval;
            }
            out.println(getMaxCover());
        }
    }

    private static int getMaxCover() {
       //todo
        return 0;
    }
}
